A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite

نویسندگان

چکیده

A subset $A$ of a semigroup $S$ is called $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. ($anti$)$chain$-$finite$ contains no infinite (anti)chains. We prove that each antichain-finite periodic and every idempotent $e$ the set $\sqrt[\infty]{e}=\{x\in S:\exists n\in\mathbb N\;\;(x^n=e)\}$ finite. This property semigroups used to finite only it chain-finite antichain-finite. Also we present an example semilattice not union finitely many chains.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every finite semigroup is embeddable in a finite relatively free semigroup

The title result is proved by a Murskii-type embedding. Results on some related questions are also obtained. For instance, it is shown that every finitely generated semigroup satisfying an identity ξ d = ξ2d is embeddable in a relatively free semigroup satisfying such an identity, generally with a larger d ; but that an uncountable semigroup may satisfy such an identity without being embeddable...

متن کامل

Antichain Algorithms for Finite Automata

We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the antichain algorithms, and applications such as the universality pro...

متن کامل

The Finite Antichain Property in Coxeter Groups

We prove that the weak order on an infinite Coxeter group contains infinite antichains if and only if the group is not affine.

متن کامل

Semigroup Kernels on Finite Sets

Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of positive definite (p.d.) kernels for two such objects that can be expressed as a function of the merger of their respective sets of components. We prove a general integral representation of such kernels and present two par...

متن کامل

ON FINITE GROUPS IN WHICH SS-SEMIPERMUTABILITY IS A TRANSITIVE RELATION

Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2021

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms10010009